On Product Logic with Truth-constants

نویسندگان

  • Petr Savický
  • Roberto Cignoli
  • Francesc Esteva
  • Lluis Godo
  • Carles Noguera
چکیده

Product Logic Π is an axiomatic extension of Hájek’s Basic Fuzzy Logic BL coping with the 1-tautologies when the strong conjunction & and implication → are interpreted by the product of reals in [0, 1] and its residuum respectively. In this paper we investigate expansions of Product Logic by adding into the language a countable set of truth-constants (one truth-constant r for each r in a countable Π-subalgebra C of [0, 1]) and by adding the corresponding book-keeping axioms for the truth-constants. We first show that the corresponding logics Π(C) are algebraizable, and hence complete with respect to the variety of Π(C)-algebras. The main result of the paper is the canonical standard completeness of these logics, that is, theorems of Π(C) are exactly the 1-tautologies of the algebra defined over the real unit interval where the truth-constants are interpreted as their own values. It is also shown that they do not enjoy the canonical strong standard completeness, but they enjoy it for finite theories when restricted to evaluated Π-formulas of the kind r → φ, where r is a truth-constant and φ a formula not containing truth-constants. Finally we consider the logics Π∆(C), the expansion of Π(C) with the well-known Baaz’s projection connective ∆, and we show canonical finite strong standard completeness for them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On completeness results for predicate

In this paper we deal with generic expansions of first-order predicate logics of some left-continuous t-norms with a countable set of truth-constants. Besides already known results for the case of Lukasiewicz logic, we obtain new conservativeness and completenesss results for some other expansions. Namely, we prove that the expansions of predicate Product, Gödel and Nilpotent Minimum logics wit...

متن کامل

Adding truth-constants to logics of continuous t-norms: Axiomatization and completeness results

In this paper we study generic expansions of logics of continuous t-norms with truth-constants, taking advantage of previous results for Lukasiewicz logic and more recent results for Gödel and Product logics. Indeed, we consider algebraic semantics for expansions of logics of continuous t-norms with a set of truth-constants {r | r ∈ C}, for a suitable countable C ⊆ [0, 1], and provide a full de...

متن کامل

On modal extensions of Product fuzzy logic

In this paper we study modal extensions of Product fuzzy logic with both relational semantics based on Kripke structures with crisp accessibility relations and algebraic semantics, when the underlying product fuzzy logic is expanded with truth-constants, the ∆ operator and with two infinitary inference rules. We provide completeness results for both kinds of semantics. Finally, we also consider...

متن کامل

Rational fuzzy attribute logic

We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka style and depending on the choice of structure of truth degrees, the logic is a decidable fragment of the Rational Pavelka logic (RPL) or the Rational Product...

متن کامل

On expansions of t-norm based logics with truth-constants

This paper focuses on completeness results about generic expansions of logics of both continuous t-norms and Weak Nilpotent Minimum (WNM) with truth-constants. Indeed, we consider algebraic semantics for expansions of these logics with a set of truth-constants {r | r ∈ C}, for a suitable countable C ⊆ [0, 1], and provide a full description of completeness results when (i) either the t-norm is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2006